Two classes of Boolean functions for dependency analysis

Two Classes of Boolean Functions for Dependency Analysis

Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analysis for databases. We identify two classes of Boolean functions that have been used: positive and ...

Higher Order-Nonlinearities on Two Classes of Boolean Functions

we compute the lower bounds on higherorder nonlinearities of monomial partial-spreads type bent Boolean function ), ( ) ( 1 2 1 2  n x Tr x f n   where , , * 2 2 n n F F x    n is an even positive integer and inverse Boolean function ), ( ) ( 2 2 1   n x Tr x g n   where , , * 2 2 n n F F x    n is any positive integer. We also show that our lower bounds are better then the Carlet...

On Pre-θ-Open Sets and Two Classes of Functions

Biologically Relevant Classes of Boolean Functions

A large influx of experimental data has prompted the development of innovative computational techniques for modeling and reverse engineering biological networks. While finite dynamical systems, in particular Boolean networks, have gained attention as relevant models of network dynamics, not all Boolean functions reflect the behaviors of real biological systems. In this work, we focus on two cla...

Learnability and Characterization Results for Classes of Boolean Functions